On diameter perfect constant-weight ternary codes
نویسنده
چکیده
From cosets of binary Hamming codes we construct diameter perfect constantweight ternary codes with weight n − 1 (where n is the code length) and distances 3 and 5. The class of distance 5 codes has parameters unknown before.
منابع مشابه
Non-existence of a ternary constant weight (16, 5, 15;2048) diameter perfect code
Ternary constant weight codes of length n = 2m, weight n − 1, cardinality 2n and distance 5 are known to exist for every m for which there exists an APN permutation of order 2m, that is, at least for all odd m ≥ 3 and for m = 6. We show the non-existence of such codes for m = 4 and prove that any codes with the parameters above are diameter perfect.
متن کامل2 9 A ug 2 01 4 Non - existence of a ternary constant weight ( 16 , 5 , 15 ; 2048 ) diameter perfect code ∗
Ternary constant weight codes of length n = 2, weight n − 1, cardinality 2 and distance 5 are known to exist for every m for which there exists an APN permutation of order 2, that is, at least for all odd m ≥ 3 and for m = 6. We show the non-existence of such codes for m = 4 and prove that any codes with the parameters above are
متن کاملOn Perfect Ternary Constant Weight Codes
We consider the space of ternary words of length n and fixed weightwwith the usual Hamming distance. A sequence of perfect single error correcting codes in this space is constructed. We prove the nonexistence of such codes with other parameters than those of the sequence.
متن کاملOn non-full-rank perfect codes over finite fields
The paper deals with the perfect 1-error correcting codes over a finite field with q elements (briefly q-ary 1-perfect codes). We show that the orthogonal code to the q-ary non-full-rank 1-perfect code of length n = (q − 1)/(q − 1) is a q-ary constant-weight code with Hamming weight equals to qm−1 where m is any natural number not less than two. We derive necessary and sufficient conditions for...
متن کاملNew Ternary and Quaternary Equidistant Constant Weight Codes
We consider the problem of finding bounds on the size of ternary and quaternary equidistant constant weight codes. We present a computer realization of an algorithm for solving the maximum clique problem. We use it for finding the exact values of the maximum size for ternary and quaternary equidistant constant weight codes for all open cases for n ≤ 10 are found.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 308 شماره
صفحات -
تاریخ انتشار 2008